Uniformly bounded orthonormal polynomials on the sphere

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniformly bounded orthonormal polynomials on the sphere

Given any ε > 0, we construct an orthonormal system of nk uniformly bounded polynomials of degree at most k on the unit sphere in R where nk is bigger than 1− ε times the dimension of the space of polynomials of degree at most k. Similarly we construct an orthonormal system of sections of powers A of a positive holomorphic line bundle on a compact Kähler manifold with cardinality bigger than 1−...

متن کامل

Online Inserting Points Uniformly on the Sphere

In many scientific and engineering applications, there are occasions where points need to be inserted uniformly onto a sphere. Previous works on uniform point insertion mainly focus on the offline version, i.e., to compute N positions on the sphere for a given interger N with the objective to distribute these points as uniformly as possible. An example application is the Thomson problem where t...

متن کامل

N ov 2 00 6 AN EXAMPLE OF AN ALMOST GREEDY UNIFORMLY BOUNDED ORTHONORMAL

We construct a uniformly bounded orthonormal almost greedy basis for L p ([0, 1]), 1 < p < ∞. The example shows that it is not possible to extend Orlicz's theorem, stating that there are no uniformly bounded orthonormal unconditional bases for L p ([0, 1]), p = 2, to the class of almost greedy bases.

متن کامل

Complete Orthonormal Sequences of Functions Uniformly Small on a Subset

where [(z) is continuous, it is clear that given an e>0 and a complete orthonormal sequence {<£„}, there exists an N = N(D, K, £, {„}) such that m^N an...

متن کامل

Uniformly bounded duplication codes

Duplication is the replacement of a factor w within a word by ww. This operation can be used iteratively to generate languages starting from words or sets of words. By undoing duplications, one can eventually reach a square-free word, the original word’s duplication root. The duplication root is unique, if the length of duplications is fixed. Based on these unique roots we define the concept of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the London Mathematical Society

سال: 2015

ISSN: 0024-6093,1469-2120

DOI: 10.1112/blms/bdv061